#!/usr/bin/env python
#
# -------------------------------
# Project2: main.py
# Fransiscus Evan Gumulya
# feg247
# -------------------------------


# To document the program
#     pydoc -w main

# -------
# globals
# -------

i = 0		#input
p1 = 2		#first prime, always 2
p2 = 0		#2nd prime, 2 when i is even, 3 when i is odd
p3 = 0		#3rd prime
p4 = 0		#4th prime
#list of all primes between 1 and sqroot of 10 million
primes =  [2,3,5,7,9,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,
     73,     79,     83,     89,     97,    101,    103,    107,    109,    113,
    127,    131,    137,    139,    149,    151,    157,    163,    167,    173,
    179,    181,    191,    193,    197,    199,    211,    223,    227,    229,
    233,    239,    241,    251,    257,    263,    269,    271,    277,    281,
    283,    293,    307,    311,    313,    317,    331,    337,    347,    349,
    353,    359,    367,    373,    379,    383,    389,    397,    401,    409,
    419,    421,    431,    433,    439,    443,    449,    457,    461,    463,
    467,    479,    487,    491,    499,    503,    509,    521,    523,    541,
    547,    557,    563,    569,    571,    577,    587,    593,    599,    601,
    607,    613,    617,    619,    631,    641,    643,    647,    653,    659,
    661,    673,    677,    683,    691,    701,    709,    719,    727,    733,
    739,    743,    751,    757,    761,    769,    773,    787,    797,    809,
    811,    821,    823,    827,    829,    839,    853,    857,    859,    863,
    877,    881,    883,    887,    907,    911,    919,    929,    937,    941,
    947,    953,    967,    971,    977,    983,    991,    997,   1009,   1013,
   1019,   1021,   1031,   1033,   1039,   1049,   1051,   1061,   1063,   1069,
   1087,   1091,   1093,   1097,   1103,   1109,   1117,   1123,   1129,   1151,
   1153,   1163,   1171,   1181,   1187,   1193,   1201,   1213,   1217,   1223,
   1229,   1231,   1237,   1249,   1259,   1277,   1279,   1283,   1289,   1291,
   1297,   1301,   1303,   1307,   1319,   1321,   1327,   1361,   1367,   1373,
   1381,   1399,   1409,   1423,   1427,   1429,   1433,   1439,   1447,   1451,
   1453,   1459,   1471,   1481,   1483,   1487,   1489,   1493,   1499,   1511,
   1523,   1531,   1543,   1549,   1553,   1559,   1567,   1571,   1579,   1583,
   1597,   1601,   1607,   1609,   1613,   1619,   1621,   1627,   1637,   1657,
   1663,   1667,   1669,   1693,   1697,   1699,   1709,   1721,   1723,   1733,
   1741,   1747,   1753,   1759,   1777,   1783,   1787,   1789,   1801,   1811,
   1823,   1831,   1847,   1861,   1867,   1871,   1873,   1877,   1879,   1889,
   1901,   1907,   1913,   1931,   1933,   1949,   1951,   1973,   1979,   1987,
   1993,   1997,   1999,   2003,   2011,   2017,   2027,   2029,   2039,   2053,
   2063,   2069,   2081,   2083,   2087,   2089,   2099,   2111,   2113,   2129,
   2131,   2137,   2141,   2143,   2153,   2161,   2179,   2203,   2207,   2213,
   2221,   2237,   2239,   2243,   2251,   2267,   2269,   2273,   2281,   2287,
   2293,   2297,   2309,   2311,   2333,   2339,   2341,   2347,   2351,   2357,
   2371,   2377,   2381,   2383,   2389,   2393,   2399,   2411,   2417,   2423,
   2437,   2441,   2447,   2459,   2467,   2473,   2477,   2503,   2521,   2531,
   2539,   2543,   2549,   2551,   2557,   2579,   2591,   2593,   2609,   2617,
   2621,   2633,   2647,   2657,   2659,   2663,   2671,   2677,   2683,   2687,
   2689,   2693,   2699,   2707,   2711,   2713,   2719,   2729,   2731,   2741,
   2749,   2753,   2767,   2777,   2789,   2791,   2797,   2801,   2803,   2819,
   2833,   2837,   2843,   2851,   2857,   2861,   2879,   2887,   2897,   2903,
   2909,   2917,   2927,   2939,   2953,   2957,   2963,   2969,   2971,   2999,
   3001,   3011,   3019,   3023,   3037,   3041,   3049,   3061,   3067,   3079,
   3083,   3089,   3109,   3119,   3121,   3137,   3163]
   
# -----------
# InputReader
# -----------

class InputReader (object) :
    def read (self) :
        return raw_input()

# ------------
# OutputWriter
# ------------

class OutputWriter (object) :
    def write (self, *a) :
        for w in a :
            print w,
        print

# -------
# my_read
# -------

def my_read (r) :
    """
    reads the input (an int) and put it  into i
    return true if that succeeds, false otherwise
    """
    global i
    try :
        s = r.read()
    except EOFError :
        return False
    i = int(s)
    return True

# -------
# sieve
# -------

def sieve () :
    """
    creates a huge list that marks whether a particular integer
    is a prime or not. Unused in the final version of this program
    """
 
    myprimes = []
    for n in range(10000000):
	myprimes.append(True)
    myprimes[0] = False
    myprimes[1] = False

    x = 2
    while x < 3163 :   
      y = x
      if myprimes[y] == True :
        y += y      	
	while y < len(myprimes):
	   if myprimes[y] == True :
		myprimes[y] = False   #marks false for every multiples of x
	   #end myprimes true
	   y += x		      #goto next multiple of x
	   assert y % x == 0
	#end while y
      #end if myprimes true
      x += 1
    #end while x
    assert x >= 3163

#----------
# isPrime
#----------

def isPrime(p):
    """
    takes a number p as a parameter
    returns true if p is prime, false otherwise
    """
    assert p >= 0
    assert p % 2 == 1

    global i
    j = 1
    prime = True

    if p == 3 or p == 5 or p == 7 or p == 11 or p == 13 :
	return True			#shortcut most frequently used primes

    while j < len(primes) :
	if p != primes[j] :
	     if p % primes[j] == 0 :    #check if its divisible by any primes
		prime = False		#not a prime if p is divisible
		break
  	else:
		break
        j += 1 
    return prime

#--------
# my_eval
# -------

def my_eval () :
    """
    computes the 4 primes that sum up to i
    """
    global i, p2, p3, p4, primes

    if i == 8:
	p2 = p3 = p4 = 2	#special case
	return
    elif i & 1 == 0 :		
	p2 = 2			# even i means p1 = p2 = 2
	i -= 4			# new i = i - 2 -2
    else :
        p2 = 3			# even i means p1 = 2 p2 =3
	i -= 5			# new i = i - 2 - 3

    assert i & 1 == 0           # i is even

    #now we have an even i, and need to determine the last 2 primes.
    #according to Goldbach's Conjecture, every even integer can be 
    #expressed as a sum of two primes.

    #start with p3 = 3, because we know that every prime number after 3 must be
    #some odd number.

    p3 = 3
    p4 = i - 3		#since i is even, 1 - 3 must be odd
    while True:
	if isPrime(p3) and isPrime(p4) :
	    assert p3 + p4 == i
	    break       
        p3 += 2		#try with the next odd number
        p4 -= 2		#adjust p4 accordingly


# --------
# my_print
# --------

def my_print (w) :
    """
    writes the values of the 4 primes
    """
    w.write(p1, p2, p3, p4)

# ----
# main file
# ----

def main () :
    """
    runs the program
    """
    global i
    while my_read(InputReader()) :
        if i >= 8:
           my_eval()
           my_print(OutputWriter())
        else:
	   print "Impossible"


if __name__ == "__main__" :
    main()

